gaspersic/freeCodeCamp
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Added syntax format specifier as C

Browse Source 
Some code pieces were missing the syntax format specifier as C. So, added them.
This commit is contained in:
Vamsi Krishna
2018-10-19 11:20:34 +05:30
committed by Kristofer Koishigawa
parent 8bfe0c8ce6
commit c793f362b7
1 changed files with 14 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

18
guide/english/algorithms/binary-search-trees/index.md
View File

@ -160,7 +160,10 @@ void insert(int data) {
} }
} }
``` ```
#### Delete Operation #### Delete Operation
```c
void deleteNode(struct node* root, int data){ void deleteNode(struct node* root, int data){
if (root == NULL) root=tempnode; if (root == NULL) root=tempnode;
@ -196,6 +199,7 @@ void deleteNode(struct node* root, int data){
return root; return root;
} }
```
Binary search trees (BSTs) also give us quick access to predecessors and successors. Binary search trees (BSTs) also give us quick access to predecessors and successors.
Predecessors can be described as the node that would come right before the node you are currently at. Predecessors can be described as the node that would come right before the node you are currently at.
@ -211,15 +215,18 @@ So for instance, if we want to calculate the height of a tree, that is the heigh
* For instance, if we have a nil tree, then its height is a 0. * For instance, if we have a nil tree, then its height is a 0.
* Otherwise, We're 1 plus the maximum of the left child tree and the right child tree. * Otherwise, We're 1 plus the maximum of the left child tree and the right child tree.
* So if we look at a leaf for example, that height would be 1 because the height of the left child is nil, is 0, and the height of the nil right child is also 0. So the max of that is 0, then 1 plus 0. * So if we look at a leaf for example, that height would be 1 because the height of the left child is nil, is 0, and the height of the nil right child is also 0. So the max of that is 0, then 1 plus 0.
#### Height(tree) algorithm #### Height(tree) algorithm
```
```c
if tree = nil: if tree = nil:
return 0 return 0
return 1 + Max(Height(tree.left),Height(tree.right)) return 1 + Max(Height(tree.left),Height(tree.right))
``` ```
#### Here is the code in C++ #### Here is the code in C++
```
```c
int maxDepth(struct node* node) int maxDepth(struct node* node)
{ {
if (node==NULL) if (node==NULL)
@ -245,15 +252,18 @@ We could also look at calculating the size of a tree that is the number of nodes
* Again, if we have a nil tree, we have zero nodes. * Again, if we have a nil tree, we have zero nodes.
* Otherwise, we have the number of nodes in the left child plus 1 for ourselves plus the number of nodes in the right child. So 1 plus the size of the left tree plus the size of the right tree. * Otherwise, we have the number of nodes in the left child plus 1 for ourselves plus the number of nodes in the right child. So 1 plus the size of the left tree plus the size of the right tree.
#### Size(tree) algorithm #### Size(tree) algorithm
```
```c
if tree = nil if tree = nil
return 0 return 0
return 1 + Size(tree.left) + Size(tree.right) return 1 + Size(tree.left) + Size(tree.right)
``` ```
#### Here is the code in C++ #### Here is the code in C++
```
```c
int treeSize(struct node* node) int treeSize(struct node* node)
{ {
if (node==NULL) if (node==NULL)