W3Schools Tryit Editor

Python

Java

​x
 
class TreeNode:    def __init__(self, data):        self.data = data        self.left = None        self.right = None​root = TreeNode('R')nodeA = TreeNode('A')nodeB = TreeNode('B')nodeC = TreeNode('C')nodeD = TreeNode('D')nodeE = TreeNode('E')nodeF = TreeNode('F')nodeG = TreeNode('G')​root.left = nodeAroot.right = nodeB​nodeA.left = nodeCnodeA.right = nodeD​nodeB.left = nodeEnodeB.right = nodeF​nodeF.left = nodeG​# Testprint("root.right.left.data:", root.right.left.data)​#Python

#include <stdio.h>
#include <stdlib.h>

typedef struct TreeNode {
    char data;
    struct TreeNode* left;
    struct TreeNode* right;
} TreeNode;

TreeNode* createNewNode(char data) {
    TreeNode* newNode = (TreeNode*)malloc(sizeof(TreeNode));
    newNode->data = data;
    newNode->left = NULL;
    newNode->right = NULL;
    return newNode;
}

int main() {
    TreeNode* root = createNewNode('R');
    TreeNode* nodeA = createNewNode('A');
    TreeNode* nodeB = createNewNode('B');
    TreeNode* nodeC = createNewNode('C');
    TreeNode* nodeD = createNewNode('D');
    TreeNode* nodeE = createNewNode('E');
    TreeNode* nodeF = createNewNode('F');
    TreeNode* nodeG = createNewNode('G');

root->left = nodeA;
    root->right = nodeB;

nodeA->left = nodeC;
    nodeA->right = nodeD;

nodeB->left = nodeE;
    nodeB->right = nodeF;

nodeF->left = nodeG;

// Test
    printf("root->right->left->data: %c\n", root->right->left->data);

free(nodeG);
    free(nodeF);
    free(nodeE);
    free(nodeB);
    free(nodeC);
    free(nodeD);
    free(nodeA);
    free(root);

return 0;
}

//C

xxxxxxxxxx
 
#include <stdio.h>#include <stdlib.h>​typedef struct TreeNode {    char data;    struct TreeNode* left;    struct TreeNode* right;} TreeNode;​TreeNode* createNewNode(char data) {    TreeNode* newNode = (TreeNode*)malloc(sizeof(TreeNode));    newNode->data = data;    newNode->left = NULL;    newNode->right = NULL;    return newNode;}​int main() {    TreeNode* root = createNewNode('R');    TreeNode* nodeA = createNewNode('A');    TreeNode* nodeB = createNewNode('B');    TreeNode* nodeC = createNewNode('C');    TreeNode* nodeD = createNewNode('D');    TreeNode* nodeE = createNewNode('E');    TreeNode* nodeF = createNewNode('F');    TreeNode* nodeG = createNewNode('G');​    root->left = nodeA;    root->right = nodeB;​    nodeA->left = nodeC;    nodeA->right = nodeD;​    nodeB->left = nodeE;    nodeB->right = nodeF;​    nodeF->left = nodeG;​    // Test    printf("root->right->left->data: %c\n", root->right->left->data);​    free(nodeG);    free(nodeF);    free(nodeE);    free(nodeB);

public class Main {
    public static class TreeNode {
        char data;
        TreeNode left;
        TreeNode right;

public TreeNode(char data) {
            this.data = data;
            this.left = null;
            this.right = null;
        }
    }

public static TreeNode createNewNode(char data) {
        return new TreeNode(data);
    }

public static void main(String[] args) {
        TreeNode root = createNewNode('R');
        TreeNode nodeA = createNewNode('A');
        TreeNode nodeB = createNewNode('B');
        TreeNode nodeC = createNewNode('C');
        TreeNode nodeD = createNewNode('D');
        TreeNode nodeE = createNewNode('E');
        TreeNode nodeF = createNewNode('F');
        TreeNode nodeG = createNewNode('G');

root.left = nodeA;
        root.right = nodeB;

nodeA.left = nodeC;
        nodeA.right = nodeD;

nodeB.left = nodeE;
        nodeB.right = nodeF;

nodeF.left = nodeG;

// Test
        System.out.println("root.right.left.data: " + root.right.left.data);
    }
}

//Java

xxxxxxxxxx
 
public class Main {    public static class TreeNode {        char data;        TreeNode left;        TreeNode right;​        public TreeNode(char data) {            this.data = data;            this.left = null;            this.right = null;        }    }​    public static TreeNode createNewNode(char data) {        return new TreeNode(data);    }​    public static void main(String[] args) {        TreeNode root = createNewNode('R');        TreeNode nodeA = createNewNode('A');        TreeNode nodeB = createNewNode('B');        TreeNode nodeC = createNewNode('C');        TreeNode nodeD = createNewNode('D');        TreeNode nodeE = createNewNode('E');        TreeNode nodeF = createNewNode('F');        TreeNode nodeG = createNewNode('G');​        root.left = nodeA;        root.right = nodeB;​        nodeA.left = nodeC;        nodeA.right = nodeD;​        nodeB.left = nodeE;        nodeB.right = nodeF;​        nodeF.left = nodeG;​        // Test        System.out.println("root.right.left.data: " + root.right.left.data);    }}​//Java