fork download
  1. #include <iostream>
  2. using namespace std;
  3.  
  4. struct BinaryTreeNode{
  5. BinaryTreeNode* left;
  6. BinaryTreeNode* right;
  7. int val;
  8.  
  9. BinaryTreeNode(int value){
  10. left = NULL;
  11. right = NULL;
  12. val = value;
  13. }
  14. };
  15.  
  16. void inorder(BinaryTreeNode*root){
  17. if(root == NULL)
  18. return;
  19.  
  20. inorder(root->left);
  21.  
  22. count<<root->val<<" ";
  23.  
  24. inorder(root->right);
  25. }
  26. void preorder(BinaryTreeNode*root){
  27. if(root == NULL)
  28. return;
  29.  
  30. cout<< root->val<<" ";
  31.  
  32. preorder(root->left);
  33.  
  34. preorder(root->right);
  35. }
  36. void postorder(BinaryTreeNode*root){
  37. if(root == NULL)
  38. return:
  39.  
  40. postoder(root->left);
  41.  
  42. postorder(root->right);
  43.  
  44. cout<< root->val<<" ";
  45.  
  46. }
  47.  
  48. int SumOfAllNodes(BinaryTreeNode*root){
  49. if (root == NULL)
  50. return 0;
  51. return root->val + SumOfAllNodes(root->left) + SumOfAllNodes(root->right);
  52. }
  53.  
  54. int main(){
  55. BinaryTreeNode*root = new BinaryTreeNode(5);
  56. BinaryTreeNode* leftNode = new BinaryTreeNode(2);
  57. BinaryTreeNode* rightNode = new BinaryTreeNode(7);
  58. root->left = leftNode;
  59. root->right= rightNode;
  60. }
  61.  
Success #stdin #stdout 0.04s 25484KB
stdin
Standard input is empty
stdout
#include <iostream>
using namespace std;

struct BinaryTreeNode{
	BinaryTreeNode* left;
	BinaryTreeNode* right;
	int val;
	
	BinaryTreeNode(int value){
		left = NULL;
		right = NULL;
		val = value;
	}
};

void inorder(BinaryTreeNode*root){
	if(root == NULL)
	return;
	
	inorder(root->left);
	
	count<<root->val<<" ";
	
	inorder(root->right);
}
 void preorder(BinaryTreeNode*root){
 	if(root == NULL)
 	return;
 	
 	cout<< root->val<<" ";
 	
 	preorder(root->left);
 	
 	preorder(root->right);
 }
  void postorder(BinaryTreeNode*root){
  	if(root == NULL)
  	return:
  	
  	postoder(root->left);
  	
  	postorder(root->right);
  	
  	cout<< root->val<<" ";
  	
  }
   
  int SumOfAllNodes(BinaryTreeNode*root){
  	if (root == NULL)
        return 0;
    return root->val + SumOfAllNodes(root->left) + SumOfAllNodes(root->right);
  }

int main(){
	BinaryTreeNode*root = new BinaryTreeNode(5);
	BinaryTreeNode* leftNode = new BinaryTreeNode(2);
	BinaryTreeNode* rightNode = new BinaryTreeNode(7);
	root->left = leftNode;
	root->right= rightNode;
}