二叉树 BinaryTree.h

最新推荐文章于 2022-11-30 23:13:28 发布

J-SC-30

最新推荐文章于 2022-11-30 23:13:28 发布

阅读量1.2k

点赞数

CC 4.0 BY-SA版权

分类专栏： C++ 文章标签： C++ 二叉树

本文链接：https://blog.youkuaiyun.com/u012376067/article/details/40477139

C++ 专栏收录该内容

20 篇文章

订阅专栏

这是一个C++模板类实现的二叉树结构，包括插入元素、中序遍历、前序遍历和后序遍历等操作。类定义包含了一个节点结构TreeNode和二叉树结构BinaryTree，提供了构造函数、插入方法以及不同顺序的遍历方法。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

#ifndef BINARYTREE_H
#define BINARYTREE_H

template<typename T>
class TreeNode
{
public:
  T element; // Element contained in the node
  TreeNode<T> * left; // Pointer to the left child
  TreeNode<T> * right; // Pointer to the right child

  TreeNode() // No-arg constructor
  {
    previous = NULL;
    next = NULL;
  }

  TreeNode(T element) // Constructor
  {
    this->element = element;
    left = NULL;
    right = NULL;
  }
};

template < typename T >
class BinaryTree
{
public:
  BinaryTree();
  BinaryTree(T elements[]);
  bool insert(T element);
  void inorder();
  void preorder();
  void postorder();
  int getSize();

private:
  TreeNode<T> * root;
  int size;
  void inorder(TreeNode<T> *root);
  void postorder(TreeNode<T> *root);
  void preorder(TreeNode<T> *root);
};

template < typename T >
BinaryTree<T>::BinaryTree()
{
  root = NULL;
  size = 0;
}

/* Insert element o into the binary tree
 * Return true if the element is inserted successfully
 * Return false if the element is already in the list
 */
template <typename T>
bool BinaryTree<T>::insert(T element)
{
  if (root == NULL)
    root = new TreeNode<T>(element); // Create a new root
  else
  {
    // Locate the parent node
    TreeNode<T> *parent = NULL;
    TreeNode<T> *current = root;
    while (current != NULL)
      if (element < current->element)
      {
        parent = current;
        current = current->left;
      }
      else if (element > current->element)
      {
        parent = current;
        current = current->right;
      }
      else
        return false; // Duplicate node not inserted

    // Create the new node and attach it to the parent node
    if (element < parent->element)
      parent->left = new TreeNode<T>(element);
    else
      parent->right = new TreeNode<T>(element);
  }

  size++;
  return true; // Element inserted
}

/* Inorder traversal */
template <typename T>
void BinaryTree<T>::inorder()
{
  inorder(root);
}

/* Inorder traversal from a subtree */
template <typename T>
void BinaryTree<T>::inorder(TreeNode<T> *root)
{
  if (root == NULL) return;
  inorder(root->left);
  cout << root->element << " ";
  inorder(root->right);
}

/* Postorder traversal */
template <typename T>
void BinaryTree<T>::postorder()
{
  postorder(root);
}

/** Inorder traversal from a subtree */
template <typename T>
void BinaryTree<T>::postorder(TreeNode<T> *root)
{
  if (root == NULL) return;
  postorder(root->left);
  postorder(root->right);
  cout << root->element << " ";
}

/* Preorder traversal */
template <typename T>
void BinaryTree<T>::preorder()
{
  preorder(root);
}

/* Preorder traversal from a subtree */
template <typename T>
void BinaryTree<T>::preorder(TreeNode<T> *root)
{
  if (root == NULL) return;
  cout << root->element << " ";
  preorder(root->left);
  preorder(root->right);
}

/* Get the number of nodes in the tree */
template <typename T>
int BinaryTree<T>::getSize()
{
  return size;
}

#endif