如何在二叉搜索树中查找重复元素的数量

Question

  public void duplicate()
    {
        int repeatation = 0;
        Node current = root;
        Node duplicate = root;
        while (current == null)
        {
            if (duplicate == current || duplicate == current.right  ||  duplicate== current.left)
            {
                Console.WriteLine("node is repeated :" + duplicate);
                repeatation++;



            }

        }
        Console.WriteLine("number of repeatation is :"  + repeatation);

    }

这段代码用于二元搜索树中的重复元素以及元素重复多少次但它不能正常工作,你能不能告诉我这段代码有什么问题,我不确定我是否正确编码......

Answer 1

如果遍历树InOrder,您将获得重复的元素,因此您只需要检查值何时等于前一个,以及这发生了多少次.