Bookmarks People Window Help Search Q&A; I chegg com x G Write a method to perfo

Question

Bookmarks People Window Help Search Q&A; I chegg com x G Write a method to perform an X okprogramming/java 9780763757564lchapter-7-trees71 arn welcome, Keyur B.. kpatele 2020retails.... watch Movie and T. Od Wiley PLUS 1 D LSAauctions Lone... Putlocker The Follo.. Left Child (Left Son) of a Node when the standard tree graphic is used to depict a binary tree, a node's left chlld is the child of the node to the viewer's left. For example, in tree f presented in Figure 7.3, node B is A's left child, and node G is C's left child. When the patriarchal analogy is used, a left child is referred to as a left son. Figure 7.3 Valid Binary Trees Right Child (Right Son) of a Node When the standard tree graphic is used to depict a binary tree, a node's right child is the child of the node to the viewer's right. For example, in tree f presented in Figure 7.3, node C is A's right child, and node G is C's right child. Again, when the

Explanation / Answer

//C program
#include <stdio.h>
#include <stdlib.h>

/* A binary tree node has data, pointer to left child
and a pointer to right child */
struct node
{
   char data;
   struct node* left;
   struct node* right;
};

/* Helper function that allocates a new node with the
given data and NULL left and right pointers. */
struct node* newNode(char data)
{
   struct node* node = (struct node*)
                               malloc(sizeof(struct node));
   node->data = data;
   node->left = NULL;
   node->right = NULL;

   return(node);
}

/* Given a binary tree, print its nodes in preorder/NLR */
void printPreorder(struct node* node)
{
   if (node == NULL)
       return;

   /* first print data of node */
   printf("%c ", node->data);

   /* then recur on left sutree */
   printPreorder(node->left);

   /* now recur on right subtree */
   printPreorder(node->right);
}

/* Driver program to test above functions*/
int main()
{
    //constructing the fig 7.3 first tree
   struct node *root = newNode('A');
   root->left           = newNode('B');
   root->right       = newNode('D');
   root->left->right   = newNode('E');
   root->left->right->left   = newNode('G');
   root->left->right->right   = newNode('H');
   root->right->left = newNode('F');

   printf(" NLR traversal of binary tree is ");
   printPreorder(root);

   getchar();
   return 0;
}

/*Sample output:
NLR traversal of binary tree is
A B E G H D F
*/

Related Questions

Navigate

• Browse (All)
• Browse B
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.